n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices
نویسندگان
چکیده
منابع مشابه
n - Cube network : node disjoint shortest paths for maximal distance pairs of vertices q
In parallel and distributed systems many communications take place concurrently, so the routing algorithm as well as the underlying interconnection network play a vital role in delivering all the messages efficiently. Fault tolerance and performance are often obtained by delivering the messages through node disjoint shortest paths. In this paper we present two efficient algorithms to construct,...
متن کاملPairwise edge disjoint shortest paths in the n-cube
Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem.An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is ...
متن کاملTwo conditions for reducing the maximal length of node-disjoint paths in hypercubes
Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m ≤ n. For general case, their maximal length is not greater than the minimum of n + 1 and the ...
متن کاملMonotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any ` disjoint source-sink pairs on the directed hypercube can be connected with edge-disjoint paths, then monotonicity of...
متن کاملImproved Bounds for Shortest Paths in Dense Distance Graphs
We study the problem of computing shortest paths in so-called dense distance graphs. Every planar graph G on n vertices can be partitioned into a set of O(n/r) edge-disjoint regions (called an r-division) with O(r) vertices each, such that each region has O( √ r) vertices (called boundary vertices) in common with other regions. A dense distance graph of a region is a complete graph containing a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Computing
دوره 30 شماره
صفحات -
تاریخ انتشار 2004